package com.example.algorithm.no0021;

import com.example.algorithm.no0021.solution.DiguiSolutionImpl;

/**
 * @Description 解答测试-合并两个有序链表
 * @ClassName SolutionTest
 * @Author Administrator
 * @Date 2020/5/16 12:54
 * @Version 1.0.0
 */
public class SolutionTest {

    static String s = "()";

    public static void main(String[] args) {
        
        ListNode l1 = new ListNode(2);
        ListNode l1_23 = new ListNode(3);
        ListNode l1_234 = new ListNode(4);
        l1_23.next = l1_234;
        l1.next = l1_23;

        ListNode l2 = new ListNode(5);
        ListNode l2_56 = new ListNode(6);
        ListNode l2_564 = new ListNode(8);
        l2_56.next = l2_564;
        l2.next = l2_56;

        System.out.println("入参: l1: " + ListNode.toStr(l1) + ", l2: " + ListNode.toStr(l2));
        System.out.println("输入字符串为: " + s);

        Solution solution = new DiguiSolutionImpl();
        ListNode listNode = solution.mergeTwoLists(l1, l2);

        System.out.println(ListNode.toStr(listNode));
    }
}
